The Complexity of 3-Valued Łukasiewicz Rules
نویسندگان
چکیده
It is know that determining the satisfiability of n-valued Łukasiewicz rules is NP-complete for n ≥ 4, as well as that it can be solved in time linear in the length of the formula in the Boolean case (when n = 2). However, the complexity for n = 3 is an open problem. In this paper we formally prove that the satisfiability problem for 3-valued Łukasiewicz rules is NP-complete. Moreover, we also prove that when the consequent of the rule has at most one element, the problem is polynomially solvable.
منابع مشابه
The complexity of admissible rules of Lukasiewicz logic
We investigate the computational complexity of admissibility of inference rules in infinite-valued Lukasiewicz propositional logic ( L). It was shown in [13] that admissibility in L is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of L are PSPACE-complete. In contrast, derivable rules of L are known to be coNP-complete.
متن کاملThe Complexity of Subsumption in Fuzzy EL
Fuzzy Description Logics (DLs) are used to represent and reason about vague and imprecise knowledge that is inherent to many application domains. It was recently shown that the complexity of reasoning in finitely valued fuzzy DLs is often not higher than that of the underlying classical DL. We show that this does not hold for fuzzy extensions of the light-weight DL EL, which is used in many bio...
متن کاملStandard Fuzzy Sets and some Many - Valued Logics
After Zadeh has introduced his theory, many-valued logic began to have a new interest. Especially, Łukasiewicz logic was enclosed quite closely in fuzzy sets. There is a strong opinion that Łukasiewicz infinite-valued logic has the role as the logic of fuzzy sets, similarly as classical logic has the role as the logic of crisp sets. But actually, it seems that Kleene’s 3-valued logic was the cl...
متن کاملAdmissible Rules of Lukasiewicz Logic
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal sentences in free MV -algebras, is decidable (in PSPACE ).
متن کاملThe complexity of fuzzy EL under the Łukasiewicz T-norm
Fuzzy Description Logics (DLs) are are a family of knowledge representation formalisms designed to represent and reason about vague and imprecise knowledge that is inherent to many application domains. Previous work has shown that the complexity of reasoning in a fuzzy DL using finitely many truth degrees is usually not higher than that of the underlying classical DL. We show that this does not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015